Vector-Value Markov Decision Process for multi-objective stochastic path planning
نویسندگان
چکیده
منابع مشابه
Multi - Objective Evolutionary Path Planning
| This paper introduces a new tournament selection algorithm that can be used for evolutionary path planning systems. The fuzzy tournament selection algorithm (FTSA) described in this paper selects candidate paths (CPs) to be parents and undergo reproduction based on: (1) the euclidean distance of a path from the origin to its destination, (2) the sum of the changes in the slope of a path, and ...
متن کاملMulti-Objective Markov Decision Processes for Data-Driven Decision Support
We present new methodology based on Multi-Objective Markov Decision Processes for developing sequential decision support systems from data. Our approach uses sequential decision-making data to provide support that is useful to many different decision-makers, each with different, potentially time-varying preference. To accomplish this, we develop an extension of fitted-Q iteration for multiple o...
متن کاملMulti-objective Evolutionary Path Planning with Neutrality
One of the main challenges when developing mobile robots is path planning. Efficient and robust algorithms are needed to produce plans for the movements of the robot. Many classical path planning algorithms depend on geometrically simple environments to achieve good performance, otherwise the paths produced tend to be far from ideal especially when the paths are to be optimized for multiple obj...
متن کاملHierarchical Markov Decision Based Path Planning for Palletizing Robot
On account of the complex application environment and the large number of uncertain conditions for the palletizing robot, we do path-planning for the multiple joints robot by the algorithm based on Hierarchical Markov Decision Process. First, according to the actual working environment, we set the range of the robot’s motion and select the conventional movement combination as the basic set of t...
متن کاملD Abstract : Multi - Objective Decision - Theoretic Planning
Decision making is hard. It often requires reasoning about uncertain environments, partial observability and action spaces that are too large to enumerate. In such tasks decisiontheoretic agents can often assist us. In most research on decision-theoretic agents, the desirability of actions and their effects is codified in a scalar reward function. However, many real-world decision problems have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Intelligent Systems
سال: 2012
ISSN: 1875-8819,1448-5869
DOI: 10.3233/his-2012-0146